Reduction criterion for separability

نویسندگان

  • N. J. Cerf
  • C. Adami
  • R. M. Gingrich
چکیده

We introduce a separability criterion based on the positive map #:$ ̃(Tr $)!$ , where $ is a trace-class Hermitian operator. Any separable state is mapped by the tensor product of # and the identity into a nonnegative operator, which provides a simple necessary condition for separability. This condition is generally not sufficient because it is vulnerable to the dilution of entanglement. In the special case where one subsystem is a quantum bit, # reduces to time reversal, so that this separability condition is equivalent to partial transposition. It is therefore also sufficient for 2"2 and 2"3 systems. Finally, a simple connection between this map for two qubits and complex conjugation in the ‘‘magic’’ basis %Phys. Rev. Lett. 78, 5022 !1997"& is displayed. %S1050-2947!99"00708-8&

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On PPT States in CK ⊗ CM ⊗ CN Composite Quantum Systems

Due to the importance of quantum entangled states in quantum information and computation [1, 2, 3], much effort has been done recently towards an operational characterization of separable states [4, 5, 6]. The manifestations of mixed-state entanglement can be very subtle [7]. Till now there is no general efficient criterion in judging the separability. The Bell inequalities [8], Peres PPT crite...

متن کامل

Discriminant Neighborhood Structure Embedding Using Trace Ratio Criterion for Image Recognition

Dimensionality reduction is very important in pattern recognition, machine learning, and image recognition. In this paper, we propose a novel linear dimensionality reduction technique using trace ratio criterion, namely Discriminant Neighbourhood Structure Embedding Using Trace Ratio Criterion (TR-DNSE). TR-DNSE preserves the local intrinsic geometric structure, characterizing properties of sim...

متن کامل

Face Recognition using a Kernelization of Graph Embedding

Linearization of graph embedding has been emerged as an effective dimensionality reduction technique in pattern recognition. However, it may not be optimal for nonlinearly distributed real world data, such as face, due to its linear nature. So, a kernelization of graph embedding is proposed as a dimensionality reduction technique in face recognition. In order to further boost the recognition ca...

متن کامل

Remarks on the Cross Norm Criterion for Separability

Recently in Reference [ quant-ph/0202121] a computational criterion of separability induced by greatest cross norm is proposed by Rudolph. There, Rudolph conjectured that the new criterion is not weaker than positive partial transpose criterion for separability. We show that there exist counterexample to this claim, that is, proposed criterion is weaker than the positive partial transpose crite...

متن کامل

Separability of Tripartite Quantum Systems

i pi = 1. Many separability criteria have been found in recent years. For pure states, the problem is completely solved, e.g., by using the Schmidt decomposition [1]. For mixed states, there are separability criteria such as PPT, reduction, majorization, realignment etc. [2, 3, 4, 5, 6]. In [7] the authors have given a lower bound of concurrence for tripartite quantum states which can be used t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999